MULTI-OBJECTIVE MATHEMATICAL MODELING OF AIRCRAFT LANDING PROBLEM ON A RUNWAY IN STATIC MODE, SCHEDULING AND SEQUENCE DETERMINATION USING NSGA-II

نویسندگان

  • A. Kaveh
  • H. Rahami
  • S. Mokhtarimousavi
چکیده مقاله:

Runway length is usually a critical point in an airport system so, a great interest has been created for optimal use of this runway length. The most important factors in modeling of aircraft landing problem are time and cost while, the costs imposed on the system because of moving away from target times have different performances in terms of impact. In this paper, firstly, aircraft landing problem (ALP) and the works conducted in subject literature are briefly reviewed and presented. Then, this problem is formulated and proposed as a three-objective mathematical modeling which leads to more applicable formulation. Following this, the model introduced to solve this problem is solved for two groups including 20 and 50 aircrafts using the second version of NSGA and the results and recommendations will be provided.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Determination of the Aircraft Landing Sequence by Two Meta-Heuristic Algorithms

Due to an anticipated increase in air traffic during the next decade, air traffic control in busy airports is one of the main challenges confronting the controllers in the near future. Since the runway is often a bottleneck in an airport system, there is a great interest in optimizing the use of the runway. The most important factors in aircraft landing modeling are time and cost. For this reas...

متن کامل

Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms

The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

متن کامل

A multi-objective mathematical model for production-distribution scheduling problem

With increasing competition in the business world and the emergence and development of new technologies, many companies have turned to integrated production and distribution for timely production and delivery at the lowest cost of production and distribution and with the least delay in delivery. By increasing human population and the increase in greenhouse gas emissions and industrial waste, in...

متن کامل

optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: nsga-ii and moica algorithms

the aim of a multi-mode resource-constrained project scheduling problem (mrcpsp) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). these goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

متن کامل

A mathematical multi-objective model for treatment network design (physical-biological-thermal) using modified NSGA II

Today, sustainable development is one of the important issues in regard to the economy of a country. This issue magnifies the necessity for increased scrutiny towards issues such as environmental considerations and product recovery in closed-loop supply chains (CLSCs). The most important motivational factors influencing research on these topics can be considered in two general groups: environme...

متن کامل

Aircraft Landing Scheduling Optimization for Single Runway Noncontrolled Airports: Static Case

ai = time aircraft i lands after the preferred landing time Pi (i 1; . . . ; N) bi = time aircraft i lands before the preferred landing time Pi (i 1; . . . ; N) C = cost coefficient vector defined in the linear programming problem Ei = earliest landing time for aircraft i (i 1; . . . ; N) fi = penalty cost per unit of time if aircraft i lands before the preferred landing time Pi (i 1; . . . ; N...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 5  شماره 1

صفحات  21- 36

تاریخ انتشار 2015-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023